An Interactive Algebra Course with Formalised Proofs and Definitions
نویسندگان
چکیده
We describe a case-study of the application of web-technology (Helm [2]) to create web-based didactic material out of a repository of formal mathematics (C-CoRN [5]), using the structure of an existing course (IDA [4]). The paper discusses the difficulties related to associating notation to a formula, the embedding of formal notions into a document (the “view”), and the rendering of proofs.
منابع مشابه
Residuated Lattices
The theory of residuated lattices, first proposed by Ward and Dilworth [4], is formalised in Isabelle/HOL. This includes concepts of residuated functions; their adjoints and conjugates. It also contains necessary and sufficient conditions for the existence of these operations in an arbitrary lattice. The mathematical components for residuated lattices are linked to the AFP entry for relation al...
متن کاملRelation Algebra
Tarski’s algebra of binary relations is formalised along the lines of the standard textbooks of Maddux and Schmidt and Ströhlein. This includes relation-algebraic concepts such as subidentities, vectors and a domain operation as well as various notions associated to functions. Relation algebras are also expanded by a reflexive transitive closure operation, and they are linked with Kleene algebr...
متن کاملA Cohomology Theory for Commutative Algebras. I1
1. Introduction. D. K. Harrison has recently developed a co-homology theory for commutative algebras over a field [2]. A few key theorems are proved and the results applied to the theory of local rings and eventually to algebraic geometry. The main problem is that both his definitions and proofs require involved calculations. In this paper we define a cohomology theory which (a) relies on more ...
متن کاملA Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic
Building on work by Wainer and Wallen, formalised by James Margetson, we present soundness and completeness proofs for a system of first order logic. The completeness proofs naturally suggest an algorithm to derive proofs. This algorithm can be implemented in a tail recursive manner. We provide the formalisation in Isabelle/HOL. The algorithm can be executed via the rewriting tactics of Isabell...
متن کاملErrors and Misconceptions in College Level Theorem Proving
ALGEBRA Abstract algebra, the course from which our examples are selected, is a three hour per week year sequence usually taken in the third year of college. At this stage in a student's education the rapid development of reasoning skills is important and we have taken it as a major objective of the course.algebra, the course from which our examples are selected, is a three hour per week year s...
متن کامل